A Hybrid Grouping Genetic Algorithm for Examination Timetabling
نویسندگان
چکیده
In this paper, we present an improvement of the Grouping Genetic Algorithm (GGA) which has been described in [6]. The algorithm has been enhanced with local optimisation techniques which are based on problem-specific heuristics and incorporated into the genetic operators. First experiments on well-known benchmark problems on examination timetabling show that the new hybrid algorithm (HGGA) produces much better results than the original GGA.
منابع مشابه
Generating Optimal Timetabling for Lecturers using Hybrid Fuzzy and Clustering Algorithms
UCTTP is a NP-hard problem, which must be performed for each semester frequently. The major technique in the presented approach would be analyzing data to resolve uncertainties of lecturers’ preferences and constraints within a department in order to obtain a ranking for each lecturer based on their requirements within a department where it is attempted to increase their satisfaction and develo...
متن کاملA Hybrid Algorithm for the Examination Timetabling Problem
Examination timetabling is a well-studied combinatorial optimization problem. We present a new hybrid algorithm for examination timetabling, consisting of three phases: a constraint programming phase to develop an initial solution, a simulated annealing phase to improve the quality of solution, and a hill climbing phase for further improvement. The examination timetabling problem at the Univers...
متن کاملSolving the Examination Timetabling Problem in GPUs
The examination timetabling problem belongs to the class of combinatorial optimization problems and is of great importance for every University. In this paper, a hybrid evolutionary algorithm running on a GPU is employed to solve the examination timetabling problem. The hybrid evolutionary algorithm proposed has a genetic algorithm component and a greedy steepest descent component. The GPU comp...
متن کاملAn integer program and a hybrid genetic algorithm for the university timetabling problem
An integer program and a hybrid genetic algorithm for the university timetabling problem Xuehao Feng, Yuna Lee & Ilkyeong Moon To cite this article: Xuehao Feng, Yuna Lee & Ilkyeong Moon (2017) An integer program and a hybrid genetic algorithm for the university timetabling problem, Optimization Methods and Software, 32:3, 625-649, DOI: 10.1080/10556788.2016.1233970 To link to this article: htt...
متن کاملApplication of the Grouping Genetic Algorithm to University Course Timetabling
University Course Timetabling-Problems (UCTPs) involve the allocation of resources (such as rooms and timeslots) to all the events of a university, satisfying a set of hard-constraints and, as much as possible, some soft constraints. Here we work with a well-known version of the problem where there seems a strong case for considering these two goals as separate sub-problems. In particular we no...
متن کامل